Intersection Graphs for Families of Balls in Rn

نویسندگان

  • Paul Erdös
  • Chris D. Godsil
  • Steven G. Krantz
  • Torrence D. Parsons
چکیده

1. INTRODUCTION If F is a finite family of sets, then the intersection graph r(F) is the graph with vertex-set F and edges the unordered pairs C, D of distinct elements of F such that C n D # 0. It is easy to see [6, p. 19] that every graph G is isomorphic to some intersection graph T(F). Some interesting classes of graphs have arisen by letting F range over families of balls in some metric space, such as arcs on a circle or intervals of the real line [4], or cubes, boxes or spherical balls in n-space [9, 11, 12]. For the case of balls in R" with the Euclidean norm, Guttman [5] and Havel [7] have defined the sphericity, sph(G), of a graph G to be the least dimension n in which G is isomorphic to F(F) for F some family of open (equivalently, closed) balls of radius 1 ; and Maehara [111 has defined the contact dimension, ed(G), to be the least n for which G is isomorphic to T(F) for F some family of closed balls of radius 1 such that no pair of balls intersects in more than one point. Maehara has shown that sph(G) < cd(G) < I V(G)I-I for all graphs G, and has studied sph(G) and cd(G) as functions of the structure of G [9-11]. Roberts [12] has defined the cubicity, cub(G), of G to be the least n for which G is isomorphic to F(F) for F some family of unit cubes with edges parallel to the Cartesian coordinate axes in R". Such cubes can be viewed as balls with respect to a different norm on R", and the question arises as to how the shape of the unit ball in an n-dimensional normed linear space is related to the least n in which G can be represented by an appropriate T(F). Havel [7] has shown that there are graphs of sphericity 2 but with arbitrarily large cubicity ; Fishburn [3] has shown that there are graphs G of cubicity 2 or 3 for which sph(G) > cub(G), but remarks that it is unknown whether sph(H) > cub(H) can hold for graphs H of arbitrarily large cubicity. In this paper, we are concerned with a different type of problem. Let F be the set of all graphs F(F), where F is a family of balls of arbitrary radii in R" …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some lower bounds for the $L$-intersection number of graphs

‎For a set of non-negative integers~$L$‎, ‎the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$‎. ‎The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...

متن کامل

On cycles in intersection graphs of rings

‎Let $R$ be a commutative ring with non-zero identity. ‎We describe all $C_3$‎- ‎and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. ‎Also, ‎we shall describe all complete, ‎regular and $n$-claw-free intersection graphs. ‎Finally, ‎we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...

متن کامل

Weak Unit Disk and Interval Representation of Graphs

We study a variant of intersection representations with unit balls: unit disks in the plane and unit intervals on the line. Given a planar graph and a bipartition of the edges of the graph into near and far edges, the goal is to represent the vertices of the graph by unit-size balls so that the balls for two adjacent vertices intersect if and only if the corresponding edge is near. We consider ...

متن کامل

Intersection graphs associated with semigroup acts

The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...

متن کامل

Constructions of antimagic labelings for some families of regular graphs

In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1988